A Note On Maximality Of Ideal-Independent Sets
نویسندگان
چکیده
منابع مشابه
A note on cliques and independent sets
For integers m,n ≥ 2, let f(m,n) be the minimum order of a graph where every vertex is in both a clique of cardinality m and an independent set of cardinality n. We show that f(m,n) = d( √ m− 1 + √ n− 1)2e. In this paper we use the terminology of [1]. Specifically, graph G has vertex set V (G), edge set E(G) and order p = |V (G)|. Also, N(v) denotes the neighborhood of a vertex v, i.e., the set...
متن کاملA Note on Independent Sets in Trees
We give a simple graph-theoretical proofthat the largest number ofmaximal independent vertex sets in a tree with n vertices is given by 2k+ if n 2k, m(T) 2 if n 2k + 1, a result first proved by Wilf [SIAM J. Algebraic Discrete Methods, 7 (I 986), pp. 125-130]. We also characterize those trees achieving this maximum value. Finally we investigate some related problems. Key words, independent vert...
متن کاملA Note on the Glauber Dynamics for Sampling Independent Sets
This note considers the problem of sampling from the set of weighted independent sets of a graph with maximum degree ∆. For a positive fugacity λ, the weight of an independent set σ is λ|σ|. Luby and Vigoda proved that the Glauber dynamics, which only changes the configuration at a randomly chosen vertex in each step, has mixing time O(n log n) when λ < 2 ∆−2 for triangle-free graphs. We extend...
متن کاملA note on balanced independent sets in the cube
Ramras conjectured that the maximum size of an independent set in the discrete cube Qn containing equal numbers of sets of even and odd size is 2n−1 − ( n−1 (n−1)/2 ) when n is odd. We prove this conjecture, and find the analogous bound when n is even. The result follows from an isoperimetric inequality in the cube. The discrete hypercube Qn is the graph with vertices the subsets of [n] = {1, ....
متن کاملA note on maximum independent sets in rectangle intersection graphs
Finding the maximum independent set in the intersection graph of n axis-parallel rectangles is NP-hard. We re-examine two known approximation results for this problem. For the case of rectangles of unit height, Agarwal, van Kreveld, and Suri (1997) gave a (1+1/k)-factor algorithm with an O(n log n + n) time bound for any integer constant k ≥ 1; we describe a similar algorithm running in only O(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICAL JOURNAL OF INTERDISCIPLINARY SCIENCES
سال: 2012
ISSN: 2278-9561,2278-957X
DOI: 10.15415/mjis.2012.11007